Verifiable Encryption in Anonymous Ad Hoc Groups

نویسندگان

  • Joseph K. Liu
  • Victor K. Wei
  • Duncan S. Wong
چکیده

In a verifiable encryption, an asymmetrically encrypted ciphertext can be publicly verified to be decypherable by a designated receiver without revealing the plaintext. In this paper, we introduce publicly verifiable encryption that is intended for a single anonymous decypherer within an ad hoc group of n receivers. The verifier can ascertain that the ciphertext can be decrypted by one receiver, but it cannot find out the identity of the targeted decypherer among the n receivers in the ad hoc group. Our scheme is spontaneous: the prover does not need the collaboration from any exterior party such as TTP, group manager, or any member of the receiver group when forming this ad hoc group of n receivers. We also introduce two extensions. In the first extension a targeted subset of t receivers jointly recover the message. In the second extension, any member of a targeted subset of t receivers can recover the encrypted message. Both extensions preserve the anonymity of the targeted subset.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Verifiable Ring Encryption for Ad Hoc Groups

We propose an efficient Verifiable Ring Encryption (VRE) for ad hoc groups. VRE is a kind of verifiable encryption [16,1,4,2,8] in which it can be publicly verified that there exists at least one user, out of a designated group of n users, who can decrypt the encrypted message, while the semantic security of the message and the anonymity of the actual decryptor can be maintained. This concept w...

متن کامل

Pseudonym-based cryptography for anonymous communications in mobile ad hoc networks

Key management for anonymous communication in mobile ad hoc networks is a critical but unsolved problem. Many current anonymous mobile ad hoc routing protocols assume that mobile users share pairwise secrets before they start an anonymous communication session. This assumption is impractical for many ad hoc scenarios where pairwise shared keys are difficult to be set up in advance. Public-key b...

متن کامل

MAC Contention in a Wireless LAN with Noncooperative Anonymous Stations

In ad hoc wireless LANs populated by mutually impenetrable groups of anonymous stations, honest stations are prone to "bandwidth stealing" by selfish stations. The problem is addressed at the MAC level by postulating that (i) honest stations use a carefully designed contention strategy teaching selfish stations that the best reply is to stick to the same strategy, and (ii) a verifiable winner p...

متن کامل

Performance evaluation of an anonymity providing protocol for wireless ad hoc networks

Malicious nodes in a mobile and wireless ad hoc network can be a threat to the security and/or anonymity of the exchanged data. While data encryption can protect the content exchanged between nodes, routing information may reveal the identities of communicating nodes and their relationships. This paper describes our effort to provide anonymous communication services in mobile and wireless ad ho...

متن کامل

Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification

An ad-hoc anonymous identification scheme is a new multiuser cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove membership anonymously in such groups. Recently, Nguyen [11] proposed an ID-based ad-hoc anonymous identification scheme from bilinear pairings. However, in this paper, we propose an attack on Nguyen’s ID-based ad-hoc anonymou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004